Iterating Maps on Cellular Complexes
نویسندگان
چکیده
Let K be a finite simplicial complex and f:K—>K be a "skeletal" map. A digraph D is defined whose vertices correspond to the Simplexes of K and whose arcs give information about the behavior of / on the Simplexes. For every walk in D there exists a point of K whose iterates under / mimic the walk. Periodic walks are mimicked by a periodic point. Digraphs with uncountably many infinite walks are characterized; the corresponding maps / exhibit complicated behavior.
منابع مشابه
Optimal Estimation of Chaotic Signals Generated by Piecewise-Linear Maps
Chaotic signals generated by iterating piecewise-linear (PWL) maps on the unit interval are highly atractive in a wide range of signal processing applications. In this letter, optimal estimation algorithms for signals generated by iterating PWL maps and observed in white noise are derived based on the method of maximum likelihood (ML). It is shown how the phase space of the map may be decompose...
متن کاملCellular Automata vs. Quasisturmian Shifts
If L = Z and A is a finite set, then AL is a compact space; a cellular automaton (CA) is a continuous transformation Φ : AL−→AL that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by mapping the trajectories of an irrational torus rotation through a partition of the torus. The image of a QS shift under a CA is again QS. We study the topological ...
متن کاملHomological Algebra and Data
These lectures are a quick primer on the basics of applied algebraic topology with emphasis on applications to data. In particular, the perspectives of (elementary) homological algebra, in the form of complexes and co/homological invariants are sketched. Beginning with simplicial and cell complexes as a means of enriching graphs to higher-order structures, we define simple algebraic topological...
متن کاملA Secret Key Cryptosystem by Iterating a Chaotic Map
Abstract Chaos i s introduced to cryptology. As an example of the applications, a secret key cryptosystem by iterating a one dimensional chaotic map i s proposed. This system is based on the characteristics of chaos, which are sensitivity of parameters, sensitivity of initial points, and randomness of sequences obtained by iterating a chaotic map. A ciphertext is obtained by the iteration of a ...
متن کاملComputing by Temporal Order: Asynchronous Cellular Automata
Our concern is the behaviour of the elementary cellular automata with state set {0,1} over the cell set Z/nZ (one-dimensional finite wrap-around case), under all possible temporal rules (asynchronicity). Over the torus Z/nZ (n≤ 10),we will see that the ECA with Wolfram update rule 57 maps any v ∈ F2 to any w ∈ F2, varying the temporal rule. We furthermore show that all even (element of the alte...
متن کامل